منابع مشابه
Coarse and Uniform Embeddings into Reflexive Spaces
Answering an old problem in nonlinear theory, we show that c0 cannot be coarsely or uniformly embedded into a reflexive Banach space, but that any stable metric space can be coarsely and uniformly embedded into a reflexive space. We also show that certain quasi-reflexive spaces (such as the James space) also cannot be coarsely embedded into a reflexive space and that the unit ball of these spac...
متن کاملPlanar Embeddings with Small and Uniform Faces
Motivated by finding planar embeddings that lead to drawings with favorable aesthetics, we study the problems MINMAXFACE and UNIFORMFACES of embedding a given biconnected multi-graph such that the largest face is as small as possible and such that all faces have the same size, respectively. We prove a complexity dichotomy for MINMAXFACE and show that deciding whether the maximum is at most k is...
متن کاملA theorem of Hrushovski–Solecki–Vershik applied to uniform and coarse embeddings of the Urysohn metric space
A theorem proved by Hrushovski for graphs and extended by Solecki and Vershik (independently from each other) to metric spaces leads to a stronger version of ultrahomogeneity of the infinite random graph R, the universal Urysohn metric space U, and other related objects. We propose a new proof of the result and show how it can be used to average out uniform and coarse embeddings of U (and its v...
متن کاملUniform Linear Embeddings of Spatial Random Graphs
In a random graph with a spatial embedding, the probability of linking to a particular vertex v decreases with distance, but the rate of decrease may depend on the particular vertex v, and on the direction in which the distance increases. In this article, we consider the question when the embedding can be chosen to be uniform, so the probability of a link between two vertices depends only on th...
متن کاملRandom graphs, weak coarse embeddings, and higher index theory
This paper studies higher index theory for a random sequence of bounded degree, finite graphs with diameter tending to infinity. We show that in a natural model for such random sequences the following hold almost surely: the coarse Baum-Connes assembly map is injective; the coarse Baum-Connes assembly map is not surjective; the maximal coarse BaumConnes assembly map is an isomorphism. These res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 2017
ISSN: 0022-1236
DOI: 10.1016/j.jfa.2016.12.005